package javaTest;

import javax.swing.tree.TreeNode;
import java.util.Stack;

public class Test2 {
//后序遍历非递归的实现形式
    public void postOrderNor(TreeNode root){
        if(root==null)return;
        Stack<TreeNode> stack=new Stack<>();
        TreeNode cur=root;
        while (cur != null) {
            stack.push(cur);

        }
    }
}
